Fixed-point iteration based algorithm for a class of nonlinear programming problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

متن کامل

A Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory

A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

متن کامل

a generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. the method is easy to u...

متن کامل

Approximate solution of nonlinear inverse problems by fixed-point iteration

In this paper we propose a derivative-free iterative method for the approximate solution of a nonlinear inverse problem Fx = y. In this method the iterations are defined as Gxk+1 = Gxk +(Sy−SFxk), where G is an easily invertible operator and S is an operator from a data space to a solution space. We give general suggestions for the choice of operators G and S and show a practically relevant exa...

متن کامل

a class of nonlinear $(a,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory

a new class of nonlinear set-valued variationalinclusions involving $(a,eta)$-monotone mappings in a banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(a,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics and Computational Mechanics

سال: 2017

ISSN: 2299-9965,2353-0588

DOI: 10.17512/jamcm.2017.2.03